Fachbereich 3 Mathematik Testing Hereditary Properties Efficiently on Average Testing Hereditary Properties Eeciently on Average ?
نویسنده
چکیده
We use the quasi-ordering of substructure relations such as induced and weak subgraph, induced suborder, graph minor or subformula of a CNF formula to obtain recognition algorithms for hereditary properties that are fast on average. The ingredients needed besides inheritance are independence of the occurrence of small substructures in a random input and the existence of algorithms for recognition that are at most exponential.
منابع مشابه
Inflatable graph properties and naturalization of property tests through strong canonicality
We consider natural graph property tests, which act entirely independently of the size of the graph being tested (not just having a number of queries independent of the size). We introduce the notion of graph properties being inflatable — closed under taking (balanced) blowups — and show that the query complexity of natural tests for a property are related to the degree to which it is approxima...
متن کاملIdeal Amenability of Banach Algebras and Some Hereditary Properties
Let A be a Banach algebra. A is called ideally amenable if for every closed ideal I of A, the first cohomology group of A with coefficients in I* is trivial. We investigate the closed ideals I for which H1 (A,I* )={0}, whenever A is weakly amenable or a biflat Banach algebra. Also we give some hereditary properties of ideal amenability.
متن کاملParacompactness on supra topological spaces
In this article, we present the concept of supra paracompact spaces and study its basic properties. We elucidate its relationship with supra compact spaces and prove that the property of being a supra paracompact space is weakly hereditary and topological properties. Also, we provide some examples to show some results concerning paracompactness on topology are invalid on supra topology. Finally...
متن کاملGraph limits and testing hereditary graph properties
We show that an important recent result of Alon and Shapira on testing hereditary graph properties can be derived from the existence of a limit object for convergent graph sequences.
متن کاملInflatable Graph Properties and Natural Property Tests
We consider natural graph property tests, which act entirely independently of the size of the graph being tested (not just having a number of queries independent of the size). We introduce the notion of graph properties being inflatable — closed under taking (balanced) blowups — and show that the query complexity of natural tests for a property are related to the degree to which it is approxima...
متن کامل